Using a nonrecursive formula to determine cladogram probabilities.

نویسندگان

  • J Stone
  • J Repka
چکیده

Three properties of bifurcating branching diagrams that are used for representing a specific number of taxa are (1) the number of possible arrangements, (2) the number of possible topologies, and (3) the probabilities of formation according to particular models of cladogenesis. Of these, the probabilities have received the least attention in the literature. Indeed, many biologists would be astonished by the observation that the probability of a commonly cited cladogram containing 35 phyla of the animal kingdom is < 0.0072% of the value of the average probability taken over all possible cladograms! We reviewed works on cladogram arrangements and topologies and developed a computer-generated table of enumerations that extends and corrects such tables in the literature. We also developed a nonrecursive formula for the determination of cladogram probabilities. This formula facilitates calculation and thereby should promote use of cladogram probabilities, which might provide more accurate null hypotheses for tests of cladogenic events than do considerations of cladogram arrangements or topologies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilities on cladograms: introduction to the alpha model

The alpha model, a parametrized family of probabilities on cladograms (rooted binary leaf labeled trees), is introduced. This model is Markovian self-similar, deletion-stable (sampling consistent), and passes through the Yule, Uniform and Comb models. An explicit formula is given to calculate the probability of any cladogram or tree shape under the alpha model. Sackin's and Colless' index are s...

متن کامل

Signal processing approaches as novel tools for the clustering of N-acetyl-β-D-glucosaminidases

Nowadays, the clustering of proteins and enzymes in particular, are one of the most popular topics in bioinformatics. Increasing number of chitinase genes from different organisms and their sequences have beenidentified. So far, various mathematical algorithms for the clustering of chitinase genes have been used butmost of them seem to be confusing and sometimes insufficient. In the...

متن کامل

On memory redundancy in the BCJR algorithm for nonrecursive shift register processes

For computation of a posteriori probabilities (APP’s), the wellknown BCJR algorithm is often applied. If the underlying model is a nonrecursive shift register process, it will be shown that this algorithm obtains a general memory redundancy if the computation is performed over a commutative semiring with an absorbing zero element. The result is of particular interest for the BCJR algorithm carr...

متن کامل

The probabilities of trees and cladograms under Ford's $\alpha$-model

We give correct explicit formulas for the probabilities of rooted binary trees and cladograms under Ford’s α-model.

متن کامل

A Giambelli Formula for Isotropic Partial Flag Varieties

Let G be a classical complex Lie group, P any parabolic subgroup of G, and G/P the corresponding partial flag variety. We prove an explicit nonrecursive Giambelli formula which expresses an arbitrary Schubert class in H(G/P ) as a polynomial in certain special Schubert class generators; in the even orthogonal case this depends on the main result of [BKT4]. Our formula extends to one that applie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Systematic biology

دوره 47 4  شماره 

صفحات  -

تاریخ انتشار 1998